Load sharing for optimistic parallel simulations on multi core machines
نویسندگان
چکیده
منابع مشابه
Job Scheduling with Lookahead Group Matchmaking for Time/Space Sharing on Multi-core Parallel Machines
Multi-core nodes of parallel machines may only provide gradual performance improvement per application due to competition on resources like the cache. As shown in our earlier work, spreading out applications over as many nodes as possible or letting different applications with potentially complementary characteristics (semi time) share each node by allocating different cores to them may provide...
متن کاملOn Metrics for the Dynamic Load Balancing of Optimistic Simulations
The research described in this paper focuses on evaluating metrics for use with the dynamic load balancing of optimistic simulations. We present a load balancing algorithm in this paper which is token based and is used in conjunction with Clustered Time Warp (CTW). CTW is a hybrid synchronization protocol, which makes use of a sequential algorithm within clusters of LPs and Time Warp between th...
متن کاملParallel support vector machines on multi-core and multiprocessor systems
This paper proposes a new and efficient parallel implementation of support vector machines based on decomposition method for handling large scale datasets. The parallelizing is performed on the most time-and-memory consuming work of training, i.e., to update the vector f . The inner problems are dealt by sequential minimal optimization solver. Since the underlying parallelism is realized by the...
متن کاملIssues in Implementation of Parallel Parsing on Multi-core Machines
The advent of multi-core architecture has highly influenced the area of high performance computing. Parallel compilation is the area which still needs significant improvement by the use of this architecture. Recent research has shown some improvement in lexical analysis phase. But it is difficult to implement the same technique in parsing phase. This paper highlights some issues related to impl...
متن کاملParallel Dual Tree Traversal on Multi-core and Many-core Architectures for Astrophysical N-body Simulations
In astrophysical N -body simulations, Dehnen’s algorithm, implemented in the serial falcON code and based on a dual tree traversal, is faster than serial Barnes-Hut tree-codes, but outperformed by parallel CPU and GPU tree-codes. In this paper, we present a parallel dual tree traversal, implemented in the pfalcON code, targeting multi-core CPUs and manycore architectures (Xeon Phi). We focus he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2012
ISSN: 0163-5999
DOI: 10.1145/2425248.2425250